Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar1/TRCSRSLASHEx6_9_Luc02c

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__from₁(X)) -> FROM₁(activate₁(X))
2ND₁(cons₂(X, X1)) -> 2ND₁(cons1₂(X, activate₁(X1)))
ACTIVATE₁(n__s₁(X)) -> S₁(activate₁(X))
ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)
2ND₁(cons₂(X, X1)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__from₁(X)) -> FROM₁(activate₁(X))
2ND₁(cons₂(X, X1)) -> 2ND₁(cons1₂(X, activate₁(X1)))
ACTIVATE₁(n__s₁(X)) -> S₁(activate₁(X))
ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)
2ND₁(cons₂(X, X1)) -> ACTIVATE₁(X1)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 1 SCC with 4 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)
ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

ACTIVATE₁(n__s₁(X)) -> ACTIVATE₁(X)

Used argument filtering: ACTIVATE₁(x1) = x1
n__from₁(x1) = x1
n__s₁(x1) = n__s₁(x1)
Used ordering: Precedence:

trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPAfsSolverProof

            ↳ QDP

              ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

ACTIVATE₁(n__from₁(X)) -> ACTIVATE₁(X)

Used argument filtering: ACTIVATE₁(x1) = x1
n__from₁(x1) = n__from₁(x1)
Used ordering: Precedence:

trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPAfsSolverProof

            ↳ QDP

              ↳ QDPAfsSolverProof

                ↳ QDP

                  ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

2nd₁(cons1₂(X, cons₂(Y, Z))) -> Y
2nd₁(cons₂(X, X1)) -> 2nd₁(cons1₂(X, activate₁(X1)))
from₁(X) -> cons₂(X, n__from₁(n__s₁(X)))
from₁(X) -> n__from₁(X)
s₁(X) -> n__s₁(X)
activate₁(n__from₁(X)) -> from₁(activate₁(X))
activate₁(n__s₁(X)) -> s₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.